Primitive element theorem

In mathematics, more specifically in the area of modern algebra known as field theory, the primitive element theorem or Artin's theorem on primitive elements is a result characterizing the finite degree field extensions that possess a primitive element. More specifically, the primitive element theorem characterizes those finite degree extensions $E\supseteq F$ such that there exists $\alpha\in E$ with $E=F[\alpha]=F(\alpha)$ .

1 Terminology
2 Existence statement
3 Counterexamples
4 Constructive results
5 Example
6 See also
7 References
8 Notes

Terminology

Let $E\supseteq F$ be an arbitrary field extension. An element $\alpha\in E$ is said to be a primitive element for $E\supseteq F$ when

$E=F[\alpha].$

In this situation, the extension $E\supseteq F$ is referred to as a simple extension. Then every element x of E can be written in the form

$x=f_{n-1}{\alpha}^{n-1}%2B\cdots%2Bf_1{\alpha}%2Bf_0$ where $f_i\in F$

for all i, and $\alpha\in E$ is fixed. That is, if $E\supseteq F$ is separable of degree n, there exists $\alpha\in E$ such that the set

$\{1,\alpha,\cdots,{\alpha}^{n-1}\}$

is a basis for E as a vector space over F.

For instance, the extensions $\mathbb{Q}(\sqrt{2})\supseteq \mathbb{Q}$ and $\mathbb{Q}(x)\supseteq \mathbb{Q}$ are simple extensions with primitive elements $\sqrt{2}$ and x, respectively ( $\mathbb{Q}(x)$ denotes the field of rational functions in the indeterminate x over $\mathbb{Q}$ ).

Existence statement

The interpretation of the theorem changed with the formulation of the theory of Emil Artin, around 1930. From the time of Galois, the role of primitive elements had been to represent a splitting field as generated by a single element. This (arbitrary) choice of such an element was bypassed in Artin's treatment.^[1] At the same time, considerations of construction of such an element receded: the theorem becomes an existence theorem.

The following theorem of Artin then takes the place of the classical primitive element theorem.

Theorem

Let $E\supseteq F$ be a finite degree field extension. Then $E=F[\alpha]$ for some element $\alpha\in E$ if and only if there exist only finitely many intermediate fields K with $E\supseteq K\supseteq F$ .

A corollary to the theorem is then the primitive element theorem in the more traditional sense (where separability was usually tacitly assumed):

Corollary

Let $E\supseteq F$ be a finite degree separable extension. Then $E=F[\alpha]$ for some $\alpha\in E$ .

The corollary applies to algebraic number fields, i.e. finite extensions of the rational numbers Q, since Q has characteristic 0 and therefore every extension over Q is separable.

Counterexamples

For non-separable extensions, necessarily in characteristic p with p a prime number, then at least when the degree [L : K] is p, then L / K has a primitive element, because there are no intermediate subfields. When [L : K] = p² then there may not be a primitive element (and therefore there are infinitely many intermediate fields). This happens, for example if K is

F_p(T, U),

the field of rational functions in two indeterminates T and U over the finite field with p elements, and L is obtained from K by adjoining a p-th root of T, and of U. In fact one can see that for any α in L, the element α^p lies in K, but a primitive element must have degree p² over K.

Constructive results

Generally, the set of all primitive elements for a finite separable extension L / K is the complement of a finite collection of proper K-subspaces of L, namely the intermediate fields. This statement says nothing for the case of finite fields, for which there is a computational theory dedicated to finding a generator of the multiplicative group of the field (a cyclic group), which is a fortiori a primitive element. Where K is infinite, a pigeonhole principle proof technique considers the linear subspace generated by two elements and proves that there are only finitely many linear combinations

$\gamma = \alpha %2B c \beta\$

with c in K in it, that fail to generate the subfield containing both elements. This is almost immediate as a way of showing how Artin's result implies the classical result, and a bound for the number of exceptional c in terms of the number of intermediate fields results (this number being something that can be bounded itself by Galois theory and a priori). Therefore in this case trial-and-error is a possible practical method to find primitive elements. See the Example.

Example

It is not, for example, immediately obvious that if one adjoins to the field Q of rational numbers roots of both polynomials

$x^2 - 2\$

and

$x^2 - 3,\$

say α and β respectively, to get a field K = Q(α, β) of degree 4 over Q, that the extension is simple and there exists a primitive element γ in K so that K = Q(γ). One can in fact check that with

$\gamma = \alpha %2B \beta\$

the powers γⁱ for 0 ≤ i ≤ 3 can be written out as linear combinations of 1, α, β and αβ with integer coefficients. Taking these as a system of linear equations, or by factoring, one can solve for α and β over Q(γ) (one gets, for instance, α= $\scriptstyle\frac{\gamma^3-9\gamma}2$ ), which implies that this choice of γ is indeed a primitive element in this example. A simpler argument, assuming the knowledge of all the subfields as given by Galois theory, is to note the independence of 1, α, β and αβ over the rationals; this shows that the subfield generated by γ cannot be that generated α or β, nor in fact that generated by αβ, exhausting all the subfields of degree 2. Therefore it must be the whole field.

References

Notes

^ Israel Kleiner, A History of Abstract Algebra (2007), p. 64.